Coalitionally strategyproof functions depend only on the most-preferred alternatives
نویسنده
چکیده
In a framework allowing infinitely many individuals, I prove that coalitionally strategyproof social choice functions satisfy “tops only.” That is, they depend only on which alternative each individual prefers the most, not on which alternative she prefers the second most, the third, . . . , or the least. The functions are defined on the domain of profiles measurable with respect to a Boolean algebra of coalitions. The unrestricted domain of profiles is an example of such a domain. I also prove an extension theorem. [Journal of Economic Literature Classifications: D71, C72, C71.] [
منابع مشابه
Application of PROMETHEE method for green supplier selection: a comparative result based on preference functions
The PROMETHEE is a significant method for evaluating alternatives with respect to criteria in multi-criteria decision-making problems. It is characterized by many types of preference functions that are used for assigning the differences between alternatives in judgements. This paper proposes a preference of green suppliers using the PROMETHEE under the usual criterion preference functions. Comp...
متن کاملDivision of the Humanities and Social Sciences California Institute of Technology Pasadena, California 91125 Strategyproof and Nonbossy Assignments
We consider the assignment of heterogeneous and indivisible objects to agents without using monetary transfers, where each agent may be assigned more than one object, and the valuation of the objects to an agent may depend on what other objects the agent is assigned. The set of strategyproof, nonbossy, and Pareto-optimal social choice functions is characterized as dictatorial sequential choice ...
متن کاملOn the Tradeoff between Efficiency and Strategyproofness
We study social decision schemes (SDSs), i.e., functions that map a collection of individual preferences over alternatives to a lottery over the alternatives. Depending on how preferences over alternatives are extended to preferences over lotteries, there are varying degrees of efficiency and strategyproofness. In this paper, we consider four such preference extensions: stochastic dominance (SD...
متن کاملBetter Strategyproof Mechanisms without Payments or Prior - An Analytic Approach
We revisit the problem of designing strategyproof mechanisms for allocating divisible items among two agents who have linear utilities, where payments are disallowed and there is no prior information on the agents’ preferences. The objective is to design strategyproof mechanisms which are competitive against the most efficient (but not strategyproof) mechanism. For the case with two items: • We...
متن کاملStrategy-Proof Location Functions on Finite Graphs
A location function on a finite graph takes a set of most preferred locations (vertices of the graph) for a set of users, and returns a set of locations satisfying conditions meant to please the entire user set as much as possible. A strategyproof location function is one for which it never benefits a user to report a suboptimal preferred location. We introduce four versions of strategy-proof a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 17 شماره
صفحات -
تاریخ انتشار 2000